package Aleehot100;

/**
 * ClassName: c091
 * Package: Aleehot100
 * Description:62. 不同路径
 *
 * @Author BCXJ
 * @Create 2025/9/15 08:40
 * @Version 1.0
 * @Since 1.0
 */
public class c091 {
    public static void main(String[] args) {

    }

    public static int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
        // 初始化: 第一行，第一列
        for (int i = 0; i < n; i++) {
            dp[0][i] = 1;
        }
        for (int i = 0; i < m; i++) {
            dp[i][0] = 1;
        }

        // 动态规划
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }

        return dp[m - 1][n - 1];
    }
}
